Stable finiteness does not imply linear soficity
نویسندگان
چکیده
Abstract We prove that there exist finitely generated, stably finite algebras which are not linear sofic. This was left open by Arzhantseva and Păunescu in 2017.
منابع مشابه
Cancellation Does Not Imply Stable Rank One
An unital C∗-algebra A is said to have cancellation of projections if the semigroup D(A) of Murray-von Neumann equivalence classes of projections in matrices over A is cancellative. It has long been known that stable rank one implies cancellation for any A, and some partial converses have been established. In the sequel it is proved that cancellation does not imply stable rank one for simple, s...
متن کاملSuperintelligence Does Not Imply Benevolence
Asmachines become capable ofmore autonomous and intelligent behavior, will they also display more morally desirable behavior? Earth’s history tends to suggest that increasing intelligence, knowledge, and rationality will result in more cooperative and benevolent behavior. Animals with sophisticated nervous systems track and punish exploitative behavior, while rewarding cooperation. Humans form ...
متن کاملCount(q) Does Not Imply Count(p)
I solve a conjecture originally studied by M. Ajtai. It states that for different primes q, p the matching principles Count(q) and Count(p) are logically independent. I prove that this indeed is the case. Actually I show that Count(q) implies Count(p) exactly when each prime factor in p also is a factor in q. 1 The logic of elementary counting “She loves me, she loves me not, she loves me,. . ....
متن کاملDiversity does not Necessarily Imply Adaptability
Dynamic optimiser design currently assumes that diversity is a desirable property towards achieving adaptability, as a population-based optimiser contains an implicit memory. This paper examines the applicability of this assumption. Population-based algorithms of different size are tested against optimisers using a single solution. Results presented here suggest that this view is somewhat simpl...
متن کاملComposition Does Not Imply Adaptive Security
We study the question whether the sequential or parallel composition of two functions, each indistinguishable from a random function by non-adaptive distinguishers is secure against adaptive distinguishers. The sequential composition of F(.) and G(.) is the function G(F(.)), the parallel composition is F(.) ? G(.) where ? is some group operation. It has been shown that composition indeed gives ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical proceedings of the Cambridge Philosophical Society
سال: 2023
ISSN: ['0305-0041', '1469-8064']
DOI: https://doi.org/10.1017/s0305004123000154